Semantic tree unification grammar: a new formalism for spoken language processing
نویسنده
چکیده
In this paper we present the Semantic Tree Unification Grammar (STUG) which is a new formalism for parsing spoken language. The main motivation of this formalism is the combination of the robustness and simplicity of the classical semantic grammar to the deepness of the traditional syntactic formalisms. The key properties of STUG are: the direct linearization of the semantic structure, an economical feature structure and the simplicity of the grammar writing and modification. STUG was implemented in the OASIS system which is a system of partial parsing of spontaneous spoken language. The results of our evaluation are encouraging.
منابع مشابه
Unification-Based Semantic Interpretation in the BBN Spoken Language System
This paper describes the current state of work on unification-based semantic interpretation in HARC (for Hear and Recognize Continous speech) the BBN Spoken Language System. It presents the implementation of an integrated syntax/semantics grammar written in a unification formalism similar to Definite Clause Grammar. This formalism is described, and its use in solving a number of semantic interp...
متن کاملNon-expert access to unification based speech understanding
This paper describes the concepts behind a sub grammar design tool being developed within the EU-funded language-engineering project REWARD. The tool is a sub-component of a general platform for designing spoken language systems and addresses dialogue designers who are non-experts in natural language processing and speech technology. Yet, the tool interfaces to a powerful and “professional” uni...
متن کاملA flexible by Gosse Bouma Esther
A graph-unification-based representation language is described that was developed as the grammar formalism for the LILOG research project at IBM Germany. The Stuttgart Unification Formalism (STUF) differs from its predecessors in its higher flexibility and its algebraic structure. It is well suited for the implementation of rather different linguistic approaches, but is currently employed mainl...
متن کاملSlot Unification Grammar
In this paper we propose a framework which we call Slot Unification Grammar (SUG). This framework allows to integrate different kinds of knowledge, all of them necessary for resolution of several problems in Natural Language Processing (NLP). These problems, such as coordination, extraposition of constituents, ellipsis and anaphora, sometimes occur simultaneously and it is very useful to solve ...
متن کاملIntegrated Natural Language Generation with Schema-Tree Adjoining Grammars
This paper describes an integrated generation system (INLGS) based on the formalism of Schema–Tree Adjoining Grammars with Unification (SU–TAGs). According to this system architecture, all knowledge bases are specified in the same formalism and run the same processing algorithm. A main advantage is that negotiation between generation components can easily be imposed on the system. Moreover, onl...
متن کامل